Soft constraint problems with uncontrollable variables
نویسندگان
چکیده
Preferences and uncertainty are common in many real-life problems. In this paper we consider preferences modelled via soft constraints, that allow for the representation of quantitative preferences. Moreover, we consider uncertainty modelled via uncontrollable variables, that is, variables whose value cannot be decided by us. We also assume that some information is provided for such variables, in the form of a possibility distribution over their domains. Possibilities provide a way to model imprecise probabilities, and give us a way to know which values are more possible than others for the uncontrollable variables. For such problems, the aim is to find a solution with a high preference which is also very robust with respect to the uncontrollable part. To tackle such problems, we adopt an existing approach that eliminates the uncertain part of the problem while adding some constraints in the remaining part, and then solves the resulting problem. However, contrarily to the specific methods present in the literature, we formulate several desirable properties, on the robustness of the problem’s solutions and its relationship with their preferences, that should be satisfied by any specific method based on this approach. We also define several semantics to order the solutions according to different attitudes to risk, and we discuss which of the desirable properties are satisfied by each of the considered semantics. Finally, we present a solver for this kind of problems, and we show some experimental results of its application over classes of such problems.
منابع مشابه
Simple Temporal Problems with Preferences and Uncertainty
Simple Temporal Problems (STPs) are a restriction of the framework of Temporal Constraint Satisfaction Problems, tractable in polynomial time. Their expressiveness has been extended independently in two ways. First, to account for uncontrollable events, to Simple Temporal Problems with Uncertainty (STPUs). Second, more recently, to account for soft temporal preferences, to Simple Temporal Probl...
متن کاملA constraint satisfaction framework for decision under uncertainty
The Constraint Satisfaction Problem (CSP) framework offers a simple and sound basis for representing and solving simple decision problems, without uncertainty. This paper is devoted to an extension of the CSP framework enabling us to deal with some decisions problems under uncertainty. This extension relies on a differentiation between the agent-controllable decision variables and the uncontrol...
متن کاملModelling Soft Constraints: A Survey
Constraint programming is an approach for solving (mostly combinatorial) problems by stating constraints over the problem variables. In some problems, there is no solution satisfying all the constraints or the problem formulation must deal with uncertainty, vagueness, or imprecision. In such a case the standard constraint satisfaction techniques dealing with hard constraints cannot be used dire...
متن کاملMixed Constraint Satisfaction: A Framework for Decision Problems under Incomplete Knowledge
Constraint satisfaction is a powerful tool for representing and solving decision problems with complete knowledge about the world. We extend the CSP framework so as to represent decision problems under incomplete knowledge. The basis of the extension consists in a distinction between controllable and uncontrollable variables — hence the terminology “mixed CSP” — and a “solution” gives actually ...
متن کاملWeighted Constraint Satisfaction with Set Variables
Set variables are ubiquitous in modeling (soft) constraint problems, but efforts on practical consistency algorithms for Weighted Constraint Satisfaction Problems (WCSPs) have only been on integer variables. We adapt the classical notion of set bounds consistency for WCSPs, and propose efficient representation schemes for set variables and common unary, binary, and ternary set constraints, as w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Exp. Theor. Artif. Intell.
دوره 22 شماره
صفحات -
تاریخ انتشار 2010